maximum independent set problem造句
例句與造句
- The many challenges of designing distributed parallel algorithms apply in equal to the maximum independent set problem.
- Thus, in graphs of bounded treewidth, the maximum independent set problem may be solved in linear time.
- Finding a maximum independent set in intersection graphs is still NP-complete, but it is easier to approximate than the general maximum independent set problem.
- The problem of finding such a set is called the "'maximum independent set problem "'and is an NP-hard optimization problem.
- For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time.
- It's difficult to find maximum independent set problem in a sentence. 用maximum independent set problem造句挺難的
- For the perfect graphs, a number of NP-complete optimization problems ( graph coloring problem, maximum clique problem, and maximum independent set problem ) are polynomially solvable.
- Most obviously, the solutions to the maximum independent set problem, the maximum clique problem, and the minimum independent dominating problem must all be maximal independent sets or maximal cliques, and can be found by an algorithm that lists all maximal independent sets or maximal cliques and retains the ones with the largest or smallest size.